K-Terminal Network Permutation Importance Measure Based on Mixture C-Spectrum
نویسندگان
چکیده
منابع مشابه
Permutation importance: a corrected feature importance measure
MOTIVATION In life sciences, interpretability of machine learning models is as important as their prediction accuracy. Linear models are probably the most frequently used methods for assessing feature relevance, despite their relative inflexibility. However, in the past years effective estimators of feature relevance have been derived for highly complex or non-parametric models such as support ...
متن کاملK-Terminal Network Reliability
Let GK denote a graph G whose edges can fail and with a set K C V specified. Edge failures are independent and have known probabilities. The K-terminal reliability of GK, R(GK), is the probability that all vertices in K are connected by working edges. A factoring algorithm for computing network reliability recursively applies the formula R(GK) = piR(GK * eC) + qiR(GK e) where GK * ec is GK, wit...
متن کاملThe KR-Benes Network: A Control-Optimal Rearrangeable Permutation Network based on K-bounded Permutations
The Benes network has been used as a rearrangeable network for over 30 years for applications in circuit switching and packet routing. However the O(N logN) control complexity of the Benes is not optimal for many permutations. In this paper, we present a novel rearrangeable network that is permutation-specific control-optimal, i.e., it has the lowest control complexity for every input permutati...
متن کاملRemarks on Mix-Network Based on Permutation Networks
This paper addresses the security and efficiency issues of the Mix-net based on permutation networks introduced in [1]. We first show that the original construction results in a Mix-net that yields biased permutation, so it gives some advantage to adversaries. A simple repair is provided. We then observe that one of the original schemes can be improved so that the servers and verifier enjoy mor...
متن کاملPair-wise discrimination based on a stroke importance measure
The pair-wise discriminator is a binary classi.er that veri.es the outcome of the recognizer if it belongs to a class in a pre-de.ned confusion pair database. It is di0cult to discriminate a pair of characters that are very similar in shape except for a small di2erence, because the small di2erence can be overridden by the writing variation. This paper proposes a pair-wise discrimination method ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Xibei Gongye Daxue Xuebao/Journal of Northwestern Polytechnical University
سال: 2019
ISSN: 1000-2758,2609-7125
DOI: 10.1051/jnwpu/20193750897